Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Improved defense method for graph convolutional network based on singular value decomposition
Kejun JIN, Hongtao YU, Yiteng WU, Shaomei LI, Jianpeng ZHANG, Honghao ZHENG
Journal of Computer Applications    2023, 43 (5): 1511-1517.   DOI: 10.11772/j.issn.1001-9081.2022040553
Abstract269)   HTML5)    PDF (760KB)(141)       Save

Graph Neural Network (GNN) is vulnerable to adversarial attacks, leading to performance degradation, which affects downstream tasks such as node classification, link prediction and community detection. Therefore, the defense methods of GNN have important research value. Aiming at the problem that GNN has poor robustness when being adversarially attacked, taking Graph Convolutional Network (GCN) as the model, an improved Singular Value Decomposition (SVD) based poisoning attack defense method was proposed, named ISVDatt. In the poisoning attack scenario, the attacked graph was able to be purified by the proposed method. When the GCN was attacked by poisoning, the connected edges with large different features were first screened and deleted to keep the graph features smooth. Then, SVD and low-rank approximation operations were performed to keep the low rank of the attacked graph and clean it up. Finally, the purified graph was used for training GCN model to achieve effective defense against poisoning attack. Experiments against Metattack and DICE were conducted on the open source datasets such as Citeseer, Cora and Pubmed, and compared with the defense methods based on SVD, Pro_GNN and Robust Graph Convolutional Network (RGCN), respectively. The results show that ISVDatt has relatively better defense effect, although the classification accuracy is lower than that of Pro_GNN, but it has low complexity and negligible time overhead. Experimental results verify that ISVDatt can resist poisoning attack effectively with the consideration of both the complexity and versatility of the algorithm, and has a high practical value.

Table and Figures | Reference | Related Articles | Metrics
Graph summarization algorithm based on node similarity grouping and graph compression
Yu HONG, Hongchang CHEN, Jianpeng ZHANG, Ruiyang HUANG
Journal of Computer Applications    2023, 43 (10): 3047-3053.   DOI: 10.11772/j.issn.1001-9081.2022101535
Abstract268)   HTML26)    PDF (1105KB)(219)       Save

To solve the problem that the current graph summarization methods have high compression ratios and the graph compression algorithms cannot be directly used in downstream tasks, a fusion algorithm of graph summarization and graph compression was proposed, which called Graph Summarization algorithm based on Node Similarity grouping and graph Compression (GSNSC). Firstly, the nodes were initialized as super nodes, and the super nodes were grouped according to the similarity. Secondly, the super nodes of each group were merged until the specified number of times or nodes were reached. Thirdly, super edges and corrected edges were added between the super nodes for reconstructing the original graph. Finally, for the graph compression part, the cost of compressing and summarizing the adjacent edges of each super node were judged, and the less expensive one in these two was selected to execute. Experiments of graph compression ratio and graph query were conducted on six datasets such as Web-NotreDame, Web-Google and Web-Berkstan. Experimental results on six datasets show that, the proposed algorithm has the compression ratio reduced by at least 23 percentage points compared with SLUGGER (Scalable Lossless sUmmarization of Graphs with HiERarchy) algorithm, and the compression ratio decreased by at least 13 percentage points compared with SWeG (Summarization of Web-scale Graphs) algorithm. Experimental results on Web-NotreDame dataset show that the degree error of the proposed algorithm is reduced by 41.6% compared with that of SWeG algorithm. The above verifies that the proposed algorithm has better graph compression ratio and graph query accuracy.

Table and Figures | Reference | Related Articles | Metrics